Combinatorial perspectives on Dollo-k characters in phylogenetics

Recently, the perfect phylogeny model with persistent characters has attracted great attention in literature. It is based on assumption that complex traits or can only be gained once and lost course of evolution. Here, we consider a generalization this model, namely Dollo parsimony, allows for multiple character losses. More precisely, take combinatorial perspective notion Dollo-k characters, i.e. are at most precisely k times throughout We first introduce an algorithm spanning subtrees finding labelling given tree linear time. then compare (consisting union Dollo-0 Dollo-1 characters) general characters. While it known there strong connection between Fitch parsimony show very different. Moreover, while direct relationship number Sackin index tree, popular balance, does not generalize to In fact, determining much more involved than counting end manuscript by introducing recursive approach former. This leads polynomial time both as well computing labellings publicly available Babel package BEAST 2.